منابع مشابه
Connection Scan Algorithm
We introduce the Connection Scan Algorithm (CSA) to efficiently answer queries to timetable information systems. The input consists, in the simplest setting, of a source position and a desired target position. The output consist is a sequence of vehicles such as trains or buses that a traveler should take to get from the source to the target. We study several problem variations such as the earl...
متن کاملContinuous Square Scan Algorithm
The Square Scan Algorithm (SSA) was the first algorithm used to transform line features into vector representations automatically without any help from the user and without any use of other devices for instance, digitizer [1]. This paper presents some important modifications to the SSA algorithm. The main modification is done by drawing continuous squares to detect lines or branches without any...
متن کاملA VLSI Scan-Chain Optimization Algorithm for Multiple Scan-Paths
This paper presents an algorithm for the scanchain optimization problem in multiple-scan design methodology. The proposed algorithm, which consists of four phases, first determines pairs of scan-in and scan-out pins (Phase 1), and then assigns flip-flops to scan-paths by using a graph theoretical method (Phase 2). Next the algorithm decides connection-order of flipflops in each scan-path by usi...
متن کاملA Local Clustering Algorithm for Connection Graphs
We give a clustering algorithm for connection graphs, that is, weighted graphs in which each edge is associated with a d-dimensional rotation. The problem of interest is to identify subsets of small Cheeger ratio and which have a high level of consistency, i.e. that have small edge boundary and the rotations along any distinct paths joining two vertices are the same or within some small error f...
متن کاملRUBIN : LEE PATH CONNECTION ALGORITHM Start Goal
The Lee path connection algorithm is probably the most widely used method for finding wire paths on printed circuit boards. It is shown that the original claim of generality for the path cost function is incorrect, and a restriction, called the pathconsistency property, is introduced. The Lee algorithm holds for those path cost functions having this property. Codings for the cells of the grid a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2018
ISSN: 1084-6654,1084-6654
DOI: 10.1145/3274661